On the Block Error Probability of LP Decoding of LDPC Codes
نویسندگان
چکیده
In his thesis, Wiberg showed the existence of thresholds for families of regular low-density parity-check codes under min-sum algorithm decoding. He also derived analytic bounds on these thresholds. In this paper, we formulate similar results for linear programming decoding of regular low-density parity-check codes.
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملThe Iby and Aladar Fleischman Faculty of Engineering
This thesis deals with two approaches to the problem of suboptimal decoding of finitelength error correcting codes under a probabilistic channel model. One approach, initiated by Gallager in 1963, is based on iterative message-passing decoding algorithms. The second approach, introduced by Feldman, Wainwright and Karger in 2003, is based on linear-programming (LP). We consider families of error...
متن کاملAchieving a near-optimum erasure correction performance with low-complexity LDPC codes
SUMMARY Low-density parity-check (LDPC) codes are shown to tightly approach the performance of idealized maximum distance separable (MDS) codes over memoryless erasure channels, under maximum likelihood (ML) decoding. This is possible down to low error rates and even for small and moderate block sizes. The decoding complexity of ML decoding is kept low thanks to a class of decoding algorithms, ...
متن کاملTangential Sphere Bounds on the Ensemble Performance of ML Decoded Low Density Parity Check Codes
Low density parity check (LDPC) codes were rediscovered by MacKay and Neal [4], after being first introduced in 1961 by Gallager in his seminal work [2, 3]. The experiments with LDPC codes, indicate that like turbo codes [1], they exhibit low bit error rates at low signal to noise ratios. The performance of LDPC codes was extensively investigated since and their exceptional performance with the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0602086 شماره
صفحات -
تاریخ انتشار 2006